Compression of binary sources with side information using low-density parity-check codes
نویسندگان
چکیده
In this paper, it is shown how low-density paritycheck (LDPC) codes can be used as an application of the SlepianWolf theorem for correlated binary sources. We focus on the asymmetric case of compression with side information. The approach is based on viewing the correlation as a channel and applying the syndrome concept. The encoding and decoding procedures, i.e. the compression and decompression, are explained in detail. The simulated performance results are better than most of the existing turbo-code results available in the literature and very close to the Slepian-Wolf limit.
منابع مشابه
DEDICATION To God , My Parents , and My Sister iii
Distributed coding is a new paradigm for video transmission, based on the Wyner-Ziv theorem. In this thesis, a new Wyner-Ziv codec was proposed using non-binary Low-Density Parity-Check (LDPC) codes. Non-binary LDPC codes, developed for use in channel coding, have been extended for source coding to compress correlated non-binary sources, such as video. The approach is based on considering the c...
متن کاملImproving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کاملDistributed arithmetic coding for the Slepian-Wolf problem
Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, named “distributed arithmetic coding”, which extends arithmetic codes to the distributed case employing sequential decoding aided by the side information. In particular, we introduce a distributed binary arithmetic coder for the Slepian-Wolf coding problem...
متن کاملLow-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-density parity check (LDPC) code. Our first pair of theorems establish that there exist codes from this ensemble, with all degrees remaining bounded independently of block length, that are simultaneously optimal as bot...
متن کاملAn algebraic approach to source coding with side information using list decoding
Existing literature on source coding with side information (SCSI) mostly uses the state-ofthe-art channel codes namely LDPC codes, turbo codes, and their variants and assume classical unique decoding. In this paper, we present an algebraic approach to SCSI based on the list decoding of the underlying channel codes. We show that the theoretical limit of SCSI can be achieved in the proposed list ...
متن کامل